Lecture 6: Emulating a Faulty Mesh 6.1 Introduction: Mesh Emulation
نویسندگان
چکیده
In the last lecture, we talked about how to emulate one network on another by constructing embeddings with low load, congestion and dilation. In this lecture we apply this embedding technique to emulate a fault-free square mesh on a faulty square mesh. Up to certain fault parameters we can achieve embeddings with constant load and congestion and small dilation. This allows us to use the result of the previous lecture to say that our we have an emulation strategy with low slowdown. The material in this lecture is taken from [1].
منابع مشابه
A scalable dual-radio wireless testbed for emulating mesh networks
In this paper, we introduce and evaluate ScaleMesh, a scalable miniaturized dual-radio wireless mesh testbed based on IEEE 802.11b/g technology. ScaleMesh can emulate large-scale mesh networks within a miniaturized experimentation area by adaptively shrinking the transmission range of mesh nodes by means of variable signal attenuators. To this end, we derive a theoretical formula for approximat...
متن کامل2:5n-Step Sorting on n n Meshes in the Presence of o(pn) Worst-Case Faults
In this paper, we propose the robust algorithm-configured emulation (RACE) scheme for the design of simple and efficient robust algorithms that can run on faulty meshconnected computers. We show that 1-1 sorting (1 key per healthy processor) can be performed in 2:5n+ o(n) communication steps and 2n + o(n) comparison steps on an n n mesh with an arbitrary pattern of o(pn) faults. This running ti...
متن کامل2.5n-Step Sorting on n*n Meshes in the Presence of o(sqrt(n)) Worst-Case Faults
In this paper, we propose the robust algorithm-configured emulation (RACE) scheme for the design of simple and efficient robust algorithms that can run on faulty meshconnected computers. We show that 1-1 sorting (1 key per healthy processor) can be performed in 2:5n+ o(n) communication steps and 2n + o(n) comparison steps on an n n mesh with an arbitrary pattern of o(pn) faults. This running ti...
متن کاملOptimal Emulation of Meshes on Meshes of Trees
Many problems can be solved more eeciently on a mesh of trees network than on a mesh. Until now it has been an open problem whether the mesh of trees is always at least as fast as the mesh. In this paper, we present an emulation of N-node meshes on O(N)-node meshes of trees with constant slowdown, even though any embedding of a mesh into a mesh of trees requires dilation (log N). This demonstra...
متن کاملScalable network-on-chip architecture for configurable neural networks
Providing highly flexible connectivity is a major architectural challenge for hardware implementation of reconfigurable neural networks. We perform an analytical evaluation and comparison of different configurable interconnect architectures (mesh NoC, tree, shared bus and point-to-point) emulating variants of two neural network topologies (having full and random configurable connectivity). We d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008